SAT-Based Reachability Checking for Timed Automata with Discrete Data

Towards Automatic Composition of Web Services: A SAT-Based Phase

Automating the composition of web services is an object of a growing interest nowadays. In our former paper [3] we proposed a method for converting the problem of the composition to the problem of building a graph of worlds consisting of formally defined objects, and presented the first phase of this composition resulting in building a graph of types of services (an abstract graph). In this wor...

Checking Reachability Properties for Timed Automata via SAT

Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking

We investigate a SAT-based bounded model checking (BMC) method for MTL (metric temporal logic) that is interpreted over linear discrete infinite time models generated by discrete timed automata. In particular, we translate the existential model checking problem for MTL to the existential model checking problem for a variant of linear temporal logic (called HLTL), and we provide a SAT-based BMC ...

SAT-Modulo-Theory based Analysis of Probabilistic Hybrid Systems

The framework of hybrid discrete-continuous systems becomes increasingly popular for modeling and verifying large real-world, often safety-critical, embedded systems, e.g. in the car and aviation industry. In contrast to purely discrete models, like Kripke structures, hybrid systems additionally show continuous behavior usually modeled by differential equations. Therefore, the state space of a ...

Verifying Soft Deadlines with Probabilistic Timed Automata

This paper describes work in progess performed as part of an ongoing project aimed at the development of theoretical foundations and model checking algorithms for the verification of soft deadlines in timed systems, that is, properties such as “there is a 90% chance that the message will be delivered within 5 time units”. The research is focussed on the probabilistic timed automata model [11], ...